Bound for the Regularity of Binomial Edge Ideals of Cactus Graphs

نویسندگان

چکیده

In this article, we obtain an upper bound for the regularity of binomial edge ideal a graph whose every block is either cycle or clique. As consequence, cactus graph. We also identify certain subclass attaining bound.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Regularity of Binomial Edge Ideals of Graphs

We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for chordal graphs. We also prove the conjecture due to the authors for a class of chordal graphs. We determine the regularity of the binomial edge ideal of the join of graphs in terms of the reg...

متن کامل

An upper bound for the regularity of powers of edge ideals

‎A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$‎, ‎denoted by match$(G)$‎. ‎In this paper‎, ‎we provide a generalization of this result for powers of edge ideals‎. ‎More precisely‎, ‎we show that for every graph $G$ and every $sgeq 1$‎, ‎$${rm reg}( R‎/ ‎I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...

متن کامل

Regularity Bounds for Binomial Edge Ideals

We show that the Castelnuovo–Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.

متن کامل

Binomial Edge Ideals of Graphs

We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms. Finally, we give an upper bound for the Castelnuovo-Mumford regularity of the binomial edge ideal of...

متن کامل

Regularity of second power of edge ideals

Let G be a graph with edge ideal I(G). Benerjee and Nevo proved that for every graph G, the inequality reg(I(G)2)≤reg(I(G))+2 holds. We provide an alternative proof for this result.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebra Colloquium

سال: 2022

ISSN: ['0219-1733', '1005-3867']

DOI: https://doi.org/10.1142/s1005386722000347